Efficient Black-Box Reductions for Separable Cost Sharing

In cost-sharing games with delays, a set of agents jointly uses subset resources. Each resource has fixed cost that to be shared by the players, and each agent nonshareable player-specific delay for resource. A separable protocol determines shares are budget-balanced, separable, guarantee existence pure Nash equilibria (PNE). We provide black-box reductions reducing design such an approximation algorithm underlying cost-minimization problem. this way, we obtain protocols in matroid games, single-source connection on n-series-parallel graphs. All these efficiently computable - given initial allocation profile, cheaper profile turning into PNE. Hence, domains, any yields price stability bounded factor.